Stateful Subset Cover
نویسندگان
چکیده
This paper describes a method to convert stateless key revocation schemes based on the subset cover principle into stateful schemes. The main motivation is to reduce the bandwidth overhead to make broadcast encryption schemes more practical in network environments with limited bandwidth resources, such as cellular networks. This modification is not fully collusion-resistant. A concrete new scheme based on the Subset Difference scheme [1] is presented, accomplishing a bandwidth overhead of Δm + 2Δr + 1 compared to e.g. Logical Key Hierarchy’s 2(Δm+Δr) logm, where Δm and Δr is the number of members added and removed since the last stateful update and m is the number of current members.
منابع مشابه
Revocation and Tracing Schemes for Stateless Receivers
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of the message. We concentrate on the stateless receiver case, where the users do not (necessarily) update their state from session to session. We present a framework called the Subset-Cover framework, which abstracts a ...
متن کاملFT-FW: A cluster-based fault-tolerant architecture for stateful firewalls
Nowadays, stateful firewalls are part of the critical infrastructure of the Internet. Basically, they help to protect network services and users against attackers by means of access control and protocol conformance checkings. However, stateful firewalls are problematic from the fault-tolerance perspective since they introduce a single point of failure in the network schema. In this work, we sum...
متن کاملHash-based Signatures: An outline for a new standard
Hash-based signatures are quantumsafe and well understood. This paper presents an outline for a new standard extending the recent Internet-Draft by McGrew & Curcio. The goals of this new standard are twofold: • To extend the existing draft to include XMSS and its multi-tree version; • To prepare for possible extensions to cover stateless schemes.
متن کاملComputational Soundness Results for Stateful Applied π Calculus
In recent years, many researches have been done to establish symbolic models of stateful protocols. Two works among them, the SAPIC tool and StatVerif tool, provide a high-level specification language and an automated analysis. Their language, the stateful applied π calculus, is extended from the applied π calculus by defining explicit state constructs. Symbolic abstractions of cryptography use...
متن کاملA Broadcast Encryption Scheme with Free-Riders but Unconditional Security
We propose two schemes for efficient broadcast key establishment that enables a sender to communicate to any subset of the user-base by allowing a small ratio of free-riders. The schemes do not require stateful receivers and one scheme is unconditionally secure. The free-riders are unable to learn from the past whether they might become free-riders for a certain transmission again. We present a...
متن کامل